Entropy-based discretization methods for ranking data
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملSpatial data discretization methods for geocomputation
Geocomputation provides solutions to complex geographic problems. Continuous and discrete spatial data are involved in the geocomputational process; however, geocomputational methods for discrete spatial data cannot be directly applied to continuous or mixed spatial data. Therefore, discretization methods for continuous or mixed spatial data are involved in the process. Since spatial data has s...
متن کاملDiscretization Based on Entropy and Multiple Scanning
In this paper we present entropy driven methodology for discretization. Recently, the original entropy based discretization was enhanced by including two options of selecting the best numerical attribute. In one option, Dominant Attribute, an attribute with the smallest conditional entropy of the concept given the attribute is selected for discretization and then the best cut point is determine...
متن کاملEvolutionary Optimization Guided by Entropy-Based Discretization
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good results in relatively few function evaluations. LEM implementations tend to use sophisticated learning strategies. Here we continue an exploration of alternative and simpler learning strategies, and try Entropy-based Disc...
متن کاملDiscretization Based on Clustering Methods
Many data mining algorithms require as a pre-processing step the discretization of real-valued data. In this paper we review some discretization methods based on clustering. We describe in detail the algorithms of discretization of a continuos real-valued attribute using the hierarchical graph clustering methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2016
ISSN: 0020-0255
DOI: 10.1016/j.ins.2015.04.022